Supplementary On-line Proofs for Sampling-Diagram Automata: a Tool for Analyzing Path Quality in Tree Planners
نویسندگان
چکیده
Note that the main lemma used in the proof of Theorem 2 is Lemma 7 below, and the other lemmas are used as auxiliary geometric lemmas. For completeness , we include in this document a figure of the Promenade motion-planning problem, as it appears in the main text. q1 q2 A1 A2 B1 B2 α α 1 Fig. 1: An illustration of the Promenade motion planning problem, a square obstacle within a square bounding-box. In this example, q1 and q2 lie on opposite sides of the promenade. Type-A (solid line) and type-B (dashed line) solution paths between q1 and q2 are shown, as defined in Section 4. The ratio between their length, denoted µ, is approximately 1 3 in this case.
منابع مشابه
Sampling-Diagram Automata: A Tool for Analyzing Path Quality in Tree Planners
Sampling-based motion planners are a central tool for solving motionplanning problems in a variety of domains, but the theoretical understanding of their behavior remains limited, in particular with respect to the quality of the paths they generate (in terms of path length, clearance, etc.). In this paper we prove, for a simple family of obstacle settings, that the popular dual-tree planner Bi-...
متن کاملGraph Automata and Their Application to the Verification of Dynamic Systems
The aim of this thesis is to provide verification techniques based on formal language theory and graph theory for graph transformation systems. Graph transformation systems can be used in a large number of application areas. In many cases it is very natural to model concurrent and distributed systems or other systems, where evolving graph-like structures play a role, by means of graph transform...
متن کاملTREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملPVS Strategies for Proving Abstraction Properties of Automata
Abstractions are important in specifying and proving properties of complex systems. To prove that a given automaton implements an abstract specification automaton, one must first find the correct abstraction relation between the states of the automata, and then show that this relation is preserved by all corresponding action sequences of the two automata. This paper describes tool support based...
متن کامل